Signed tree associahedra
نویسنده
چکیده
Spines T a tree on a signed ground set V = V− t V. Spine on T = directed and labeled tree S such that • the labels of the nodes of S form a partition of the signed ground set V, • at a node labeled by U = U− t U, the source label sets of the incoming arcs are subsets of distinct connected components of TrU−, and the sink label sets of the outgoing arcs are subsets of distinct connected components of Tr U. Spine poset S(T) = poset of arc contractions on signed spines of T. Prop. The spine poset S(T) is a pure graded poset of rank |V|. Signed nested complex = simplicial complex N (T) = {N(S) | S ∈ S(T)}, where N(S) = collection of source sets of S. Exm. V− = {1, 3, 4, 5} V = {0, 2, 6, 7, 8, 9}
منابع مشابه
Two Signed Associahedra
The associahedron is a convex polytope whose vertices correspond to triangulations of a convex polygon. We define two signed or hyperoctahedral analogues of the associahedron, one of which is shown to be a simple convex polytope, and the other a regular CW-sphere.
متن کاملInequalities between Gamma-Polynomials of Graph-Associahedra
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with n vertices that induces inequalities between the γ-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the γ-polynomials of graph...
متن کاملar X iv : m at h / 06 09 18 4 v 1 [ m at h . C O ] 6 S ep 2 00 6 FACES OF GENERALIZED PERMUTOHEDRA
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f -, hand γ-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, graphical zonotopes, nestohedra, and other interesting polytopes. We give several explicit formulas involving descent statistics, calculate generating functions and discuss their relationship with Simon...
متن کاملCombinatorics of Minkowski decomposition of associahedra
Realisations of associahedra can be obtained from the classical permutahedron by removing some of its facets and the set of these facets is determined by the diagonals of certain labeled convex planar n-gons as shown by Hohlweg and Lange (2007). Ardila, Benedetti, and Doker (2010) expressed polytopes of this type as Minkowski sums and differences of dilated faces of a standard simplex and compu...
متن کاملOn the Diameter of Tree Associahedra
We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph G is the skeleton of a polytope called the graph associahedron of G. We cons...
متن کامل